Szilard Languages Associated to Parallel Communicating Grammar Systems
نویسنده
چکیده
We associate Szilard and extended Szilard languages to parallel communicating grammar systems, starting from labels associated to productions of the components of the systems. We study families of such languages associated to various classes of parallel communicating grammar systems, comparing them to each other, to families of languages generated by regulated rewriting devices or by parallel communicating grammar systems. TUCS Research Group \Mathematical Structures of Computer Science"
منابع مشابه
Grammar Systems as Language Analyzers and Recursively Enumerable Languages
We consider parallel communicating grammar systems which consist of several grammars and perform derivation steps, where each of the grammars works in a parallel and synchronized manner on its own sentential form, and communication steps, where a transfer of sentential forms is done. We discuss accepting and analyzing versions of such grammar systems with context-free productions and present ch...
متن کاملOn the number of components for some parallel communicating grammar systems
In natural languages, there occur phenomena like multiple agreements, crossed agreements and replication. These aspects are represented by the three languages K1 = {anbncn | n ≥ 1}, K2 = {anbmcndm | m, n ≥ 1} and K3 = {ww | w ∈ {a, b}}, respectively. These languages are of interest, when modeling natural languages. In the present paper, we give parallel communicating grammar systems (PC grammar...
متن کاملRemarks on Context-Free Parallel Communicating Grammar Systems Generating Crossed Agreements
When modeling natural languages, three phenomena should be considered: the so-called multiple agreements, crossed agreements and replication. These aspects are represented by the three languages K1 = { a nbncn | n ≥ 1 }, K2 = { a nbmcndm | m ≥ 1, n ≥ 1 }, and K3 = {ww |w ∈ { a, b } + }, respectively. In the present paper, we give parallel communicating grammar systems (PC grammar systems) that ...
متن کاملOn context-free parallel communicating grammar systems: synchronization, communication, and normal forms
In this paper we study the generative power of context-free returning parallel communicating grammar systems using diierent synchronization mechanisms and communication protocols. We demonstrate the equivalence of several types of these systems and present normal form theorems showing that all languages generated by context-free returning parallel communicating grammar systems can also be gener...
متن کاملPattern Languages Versus Parallel Communicating Grammar Systems
We compare the power of two (fairly di erent) recently investigated language identifying devices: patterns and parallel communicating (PC) grammar systems. The simulation of multi-patterns by context-free PC grammar systems is rather obvious, but, unexpectedly, this can be realized also by (non-centralized) PC grammar systems with right-linear components. Moreover, in nite multi-patterns formin...
متن کامل